Applications of Homomorphic Functions to Software Obfuscation
نویسندگان
چکیده
1 Computer Science Department, The University of Auckland, Auckland, New Zealand [email protected], [email protected] 2 The Key Laboratory of Complex Systems and Intelligent Science, Institute of Automation, The Chinese Academy of Sciences, Beijing 100080, China 3 Systems and Industrial Engineering Department, The University of Arizona, Tucson, AZ 85721, USA [email protected]
منابع مشابه
Concepts and Techniques in Software Watermarking and Obfuscation
With the rapid development of the internet, copying a digital document is so easy and economically affordable that digital piracy is rampant. As a result, software protection has become a vital issue in current computer industry and a hot research topic. Software watermarking and obfuscation are techniques to protect software from unauthorized access, modification, and tampering. While software...
متن کاملObfuscation of Probabilistic Circuits and Applications
This paper studies the question of how to define, construct, and use obfuscators for probabilistic programs. Such obfuscators compile a possibly randomized program into a deterministic one, which achieves computationally indistinguishable behavior from the original program as long as it is run on each input at most once. For obfuscation, we propose a notion that extends indistinguishability obf...
متن کاملNotes in Computer Science 2139
Informally, an obfuscator O is an (efficient, probabilistic) “compiler” that takes as input a program (or circuit) P and produces a new program O(P ) that has the same functionality as P yet is “unintelligible” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic and complexity-theoretic applications, ranging from software protection to homomorphic encryption to...
متن کاملBootstrapping Obfuscators via Fast Pseudorandom Functions
We show that it is possible to upgrade an obfuscator for a weak complexity class WEAK into an obfuscator for arbitrary polynomial size circuits, assuming that the class WEAK can compute pseudorandom functions. Specifically, under standard intractability assumptions (e.g., hardness of factoring, Decisional Diffie-Hellman, or Learning with Errors), the existence of obfuscators for NC or even TC i...
متن کاملBasing Obfuscation on Simple Tamper-Proof Hardware Assumptions
Code obfuscation is one of the most powerful concepts in cryptography. It could yield functional encryption, digital rights management, and maybe even secure cloud computing. However, general code obfuscation has been proven impossible and the research then focused on obfuscating very specific functions, studying weaker security definitions for obfuscation, and using tamper-proof hardware token...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006